TSTP Solution File: NUM682^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM682^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:14:18 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 51 ( 15 unt; 8 typ; 0 def)
% Number of atoms : 231 ( 87 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 350 ( 74 ~; 29 |; 6 &; 210 @)
% ( 0 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 0 ^ 59 !; 0 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
z: nat ).
thf(func_def_4,type,
less: nat > nat > $o ).
thf(func_def_5,type,
pl: nat > nat > nat ).
thf(func_def_7,type,
more: nat > nat > $o ).
thf(f64,plain,
$false,
inference(subsumption_resolution,[],[f62,f48]) ).
thf(f48,plain,
! [X1: nat] :
( ( less @ X1 @ X1 )
!= $true ),
inference(equality_resolution,[],[f45]) ).
thf(f45,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( less @ X1 @ X0 ) )
| ( X0 != X1 ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f36,plain,
! [X0: nat,X1: nat] :
( ( ( $true
!= ( less @ X1 @ X0 ) )
| ( X0 != X1 ) )
& ( ( $true
!= ( more @ X1 @ X0 ) )
| ( X0 != X1 ) )
& ( ( $true
!= ( more @ X1 @ X0 ) )
| ( $true
!= ( less @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f29]) ).
thf(f29,plain,
! [X1: nat,X0: nat] :
( ( ( $true
!= ( less @ X0 @ X1 ) )
| ( X0 != X1 ) )
& ( ( $true
!= ( more @ X0 @ X1 ) )
| ( X0 != X1 ) )
& ( ( $true
!= ( more @ X0 @ X1 ) )
| ( $true
!= ( less @ X0 @ X1 ) ) ) ),
inference(flattening,[],[f28]) ).
thf(f28,plain,
! [X1: nat,X0: nat] :
( ( ( $true
!= ( less @ X0 @ X1 ) )
| ( X0 != X1 ) )
& ( ( $true
!= ( more @ X0 @ X1 ) )
| ( $true
!= ( less @ X0 @ X1 ) ) )
& ( ( $true
!= ( more @ X0 @ X1 ) )
| ( X0 != X1 ) ) ),
inference(ennf_transformation,[],[f23]) ).
thf(f23,plain,
! [X1: nat,X0: nat] :
~ ( ( ( X0 = X1 )
=> ( $true
!= ( more @ X0 @ X1 ) ) )
=> ( ( ( $true
= ( more @ X0 @ X1 ) )
=> ( $true
!= ( less @ X0 @ X1 ) ) )
=> ~ ( ( $true
= ( less @ X0 @ X1 ) )
=> ( X0 != X1 ) ) ) ),
inference(flattening,[],[f13]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( $true
!= ( more @ X0 @ X1 ) ) )
=> ~ ~ ( ( ( $true
= ( more @ X0 @ X1 ) )
=> ( $true
!= ( less @ X0 @ X1 ) ) )
=> ~ ( ( $true
= ( less @ X0 @ X1 ) )
=> ( X0 != X1 ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ~ ( more @ X0 @ X1 ) )
=> ~ ~ ( ( ( more @ X0 @ X1 )
=> ~ ( less @ X0 @ X1 ) )
=> ~ ( ( less @ X0 @ X1 )
=> ( X0 != X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X1: nat,X2: nat] :
~ ( ( ( X1 = X2 )
=> ~ ( more @ X1 @ X2 ) )
=> ~ ~ ( ( ( more @ X1 @ X2 )
=> ~ ( less @ X1 @ X2 ) )
=> ~ ( ( less @ X1 @ X2 )
=> ( X1 != X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.B2Hz0GYtCj/Vampire---4.8_12133',satz10b) ).
thf(f62,plain,
( ( less @ ( pl @ x @ z ) @ ( pl @ x @ z ) )
= $true ),
inference(superposition,[],[f41,f60]) ).
thf(f60,plain,
x = y,
inference(subsumption_resolution,[],[f59,f40]) ).
thf(f40,plain,
( ( less @ x @ y )
!= $true ),
inference(cnf_transformation,[],[f24]) ).
thf(f24,plain,
( ( less @ x @ y )
!= $true ),
inference(flattening,[],[f15]) ).
thf(f15,plain,
( ( less @ x @ y )
!= $true ),
inference(fool_elimination,[],[f14]) ).
thf(f14,plain,
~ ( less @ x @ y ),
inference(rectify,[],[f8]) ).
thf(f8,negated_conjecture,
~ ( less @ x @ y ),
inference(negated_conjecture,[],[f7]) ).
thf(f7,conjecture,
less @ x @ y,
file('/export/starexec/sandbox/tmp/tmp.B2Hz0GYtCj/Vampire---4.8_12133',satz20c) ).
thf(f59,plain,
( ( x = y )
| ( ( less @ x @ y )
= $true ) ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ( ( less @ x @ y )
= $true )
| ( $true != $true )
| ( x = y ) ),
inference(superposition,[],[f57,f39]) ).
thf(f39,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( more @ X0 @ X1 ) )
| ( $true
= ( less @ X0 @ X1 ) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f35,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( less @ X0 @ X1 ) )
| ( X0 = X1 )
| ( $true
= ( more @ X0 @ X1 ) ) ),
inference(rectify,[],[f33]) ).
thf(f33,plain,
! [X1: nat,X0: nat] :
( ( $true
= ( less @ X1 @ X0 ) )
| ( X0 = X1 )
| ( $true
= ( more @ X1 @ X0 ) ) ),
inference(flattening,[],[f32]) ).
thf(f32,plain,
! [X1: nat,X0: nat] :
( ( $true
= ( less @ X1 @ X0 ) )
| ( $true
= ( more @ X1 @ X0 ) )
| ( X0 = X1 ) ),
inference(ennf_transformation,[],[f26]) ).
thf(f26,plain,
! [X1: nat,X0: nat] :
( ( X0 != X1 )
=> ( ( $true
!= ( more @ X1 @ X0 ) )
=> ( $true
= ( less @ X1 @ X0 ) ) ) ),
inference(flattening,[],[f21]) ).
thf(f21,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ( $true
!= ( more @ X1 @ X0 ) )
=> ( $true
= ( less @ X1 @ X0 ) ) ) ),
inference(fool_elimination,[],[f20]) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ~ ( more @ X1 @ X0 )
=> ( less @ X1 @ X0 ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
! [X2: nat,X1: nat] :
( ( X1 != X2 )
=> ( ~ ( more @ X1 @ X2 )
=> ( less @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.B2Hz0GYtCj/Vampire---4.8_12133',satz10a) ).
thf(f57,plain,
( ( more @ x @ y )
!= $true ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
( ( $true != $true )
| ( ( more @ x @ y )
!= $true ) ),
inference(superposition,[],[f54,f41]) ).
thf(f54,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( less @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) )
!= $true )
| ( ( more @ X0 @ X2 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f53]) ).
thf(f53,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( $true != $true )
| ( ( less @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) )
!= $true )
| ( ( more @ X0 @ X2 )
!= $true ) ),
inference(superposition,[],[f43,f37]) ).
thf(f37,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( $true
= ( more @ ( pl @ X2 @ X0 ) @ ( pl @ X1 @ X0 ) ) )
| ( ( more @ X2 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f34]) ).
thf(f34,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( $true
= ( more @ ( pl @ X2 @ X0 ) @ ( pl @ X1 @ X0 ) ) )
| ( ( more @ X2 @ X1 )
!= $true ) ),
inference(rectify,[],[f27]) ).
thf(f27,plain,
! [X0: nat,X2: nat,X1: nat] :
( ( $true
= ( more @ ( pl @ X1 @ X0 ) @ ( pl @ X2 @ X0 ) ) )
| ( ( more @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( more @ X1 @ X2 )
= $true )
=> ( $true
= ( more @ ( pl @ X1 @ X0 ) @ ( pl @ X2 @ X0 ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( more @ X1 @ X2 )
=> ( more @ ( pl @ X1 @ X0 ) @ ( pl @ X2 @ X0 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X3: nat,X1: nat,X2: nat] :
( ( more @ X1 @ X2 )
=> ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.B2Hz0GYtCj/Vampire---4.8_12133',satz19a) ).
thf(f43,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( more @ X1 @ X0 ) )
| ( $true
!= ( less @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f41,plain,
( ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
= $true ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
less @ ( pl @ x @ z ) @ ( pl @ y @ z ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
less @ ( pl @ x @ z ) @ ( pl @ y @ z ),
file('/export/starexec/sandbox/tmp/tmp.B2Hz0GYtCj/Vampire---4.8_12133',l) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NUM682^1 : TPTP v8.1.2. Released v3.7.0.
% 0.09/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 15:19:38 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TH0_THM_EQU_NAR problem
% 0.11/0.33 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.B2Hz0GYtCj/Vampire---4.8_12133
% 0.11/0.34 % (12243)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.11/0.34 % (12241)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.11/0.34 % (12242)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.11/0.34 % (12247)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.11/0.34 % (12246)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.11/0.34 % (12244)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.11/0.34 % (12245)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.11/0.34 % (12248)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.11/0.34 % (12246)Refutation not found, incomplete strategy
% 0.11/0.34 % (12246)------------------------------
% 0.11/0.34 % (12246)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (12246)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.34
% 0.11/0.34
% 0.11/0.34 % (12246)Memory used [KB]: 5373
% 0.11/0.34 % (12246)Time elapsed: 0.002 s
% 0.11/0.34 % (12246)Instructions burned: 2 (million)
% 0.11/0.34 % (12246)------------------------------
% 0.11/0.34 % (12246)------------------------------
% 0.11/0.34 % (12241)First to succeed.
% 0.11/0.34 % (12242)Instruction limit reached!
% 0.11/0.34 % (12242)------------------------------
% 0.11/0.34 % (12242)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (12242)Termination reason: Unknown
% 0.11/0.34 % (12242)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (12242)Memory used [KB]: 5500
% 0.11/0.34 % (12244)Instruction limit reached!
% 0.11/0.34 % (12244)------------------------------
% 0.11/0.34 % (12244)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (12244)Termination reason: Unknown
% 0.11/0.34 % (12244)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (12244)Memory used [KB]: 5500
% 0.11/0.34 % (12244)Time elapsed: 0.003 s
% 0.11/0.34 % (12244)Instructions burned: 3 (million)
% 0.11/0.34 % (12244)------------------------------
% 0.11/0.34 % (12244)------------------------------
% 0.11/0.34 % (12242)Time elapsed: 0.004 s
% 0.11/0.34 % (12242)Instructions burned: 6 (million)
% 0.11/0.34 % (12242)------------------------------
% 0.11/0.34 % (12242)------------------------------
% 0.11/0.34 % (12248)Instruction limit reached!
% 0.11/0.34 % (12248)------------------------------
% 0.11/0.34 % (12248)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (12248)Termination reason: Unknown
% 0.11/0.34 % (12248)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (12248)Memory used [KB]: 5500
% 0.11/0.34 % (12248)Time elapsed: 0.004 s
% 0.11/0.34 % (12248)Instructions burned: 4 (million)
% 0.11/0.34 % (12248)------------------------------
% 0.11/0.34 % (12248)------------------------------
% 0.11/0.34 % (12243)Also succeeded, but the first one will report.
% 0.11/0.35 % (12245)Instruction limit reached!
% 0.11/0.35 % (12245)------------------------------
% 0.11/0.35 % (12245)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (12245)Termination reason: Unknown
% 0.11/0.35 % (12245)Termination phase: Saturation
% 0.11/0.35
% 0.11/0.35 % (12245)Memory used [KB]: 1023
% 0.11/0.35 % (12245)Time elapsed: 0.004 s
% 0.11/0.35 % (12245)Instructions burned: 3 (million)
% 0.11/0.35 % (12245)------------------------------
% 0.11/0.35 % (12245)------------------------------
% 0.11/0.35 % (12241)Refutation found. Thanks to Tanya!
% 0.11/0.35 % SZS status Theorem for Vampire---4
% 0.11/0.35 % SZS output start Proof for Vampire---4
% See solution above
% 0.11/0.35 % (12241)------------------------------
% 0.11/0.35 % (12241)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (12241)Termination reason: Refutation
% 0.11/0.35
% 0.11/0.35 % (12241)Memory used [KB]: 5500
% 0.11/0.35 % (12241)Time elapsed: 0.006 s
% 0.11/0.35 % (12241)Instructions burned: 3 (million)
% 0.11/0.35 % (12241)------------------------------
% 0.11/0.35 % (12241)------------------------------
% 0.11/0.35 % (12240)Success in time 0.006 s
% 0.11/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------